Bundling three convex polygons to minimize area or perimeter
نویسندگان
چکیده
منابع مشابه
Bundling Three Convex Polygons to Minimize Area or Perimeter
Given a set P = {P0, . . . , Pk−1} of k convex polygons having n vertices in total in the plane, we consider the problem of finding k translations τ0, . . . , τk−1 of P0, . . . , Pk−1 such that the translated copies τiPi are pairwise disjoint and the area or the perimeter of the convex hull of ⋃k−1 i=0 τiPi is minimized. When k = 2, the problem can be solved in linear time but no previous work ...
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کاملRemoving Outliers to Minimize Area and Perimeter
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O ( n (( 4c 2c ) (3c) + log n )) time algorithm that solves this problem when “smallest” is taken to mean least area or least perimeter.
متن کاملAsymptotic behaviour of convex and column-convex lattice polygons with fixed area and varying perimeter
We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight μ exp[−Jb] is associated to a polygon with perimeter t and b bends. The mean perimeter is calculated as a function of the fugacity μ and the bending rigidity J . In the limit μ → 0, the mean perimeter has the asymptotic behaviour 〈t〉/4 √ A ≃ 1−K...
متن کاملMaximal perimeter, diameter and area of equilateral unit-width convex polygons
The paper answers the three distinct questions of maximizing the perimeter, diameter and area of equilateral unit-width convex polygons. The solution to each of these problems is trivially unbounded when the number of sides is even. We show that when this number is odd, the optimal solution to these three problems is identical, and arbitrarily close to a trapezoid. The paper also considers the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.10.003